Meta-modeling Extension of Horn-SROIQ and Query Answering
نویسنده
چکیده
We investigate reasoning and query answering in expressive domain knowledge bases (KBs) that are in OWL 2 Full and contain large individual data sets. For this, we introduce Hi(Horn-SROIQ) and meta-queries based on HiLog semantics. Hi(Horn-SROIQ) is extended from Horn-SROIQ, the horn fragment of the most expressive description logic (DL) for OWL 2 with well known low data complexity, by allowing classes and roles to be used as individuals. Accordingly, meta-queries are obtained from conjunctive queries by allowing variables to appear in the class and role positions. For reasoning, we first provide a method of reducing satisfiability checking and conjunctive query answering in Hi(Horn-SROIQ) to the corresponding reasoning tasks in Horn-SROIQ soundly and completely, then we show that meta-query answering in Hi(Horn-SROIQ) can be captured by conjunctive query answering. Based on this, we obtain that adding meta-modeling capability to Hi(HornSROIQ) has no impact on the complexity of the considered reasoning tasks. These results make Hi(Horn-SROIQ) appealing for practical usage.
منابع مشابه
Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ
The high computational complexity of the expressive Description Logics (DLs) that underlie the OWL standard has motivated the study of their Horn fragments, which are usually tractable in data complexity and can also have lower combined complexity, particularly for query answering. In this paper we provide algorithms for answering conjunctive 2-way regular path queries (2CRPQs), a nontrivial ge...
متن کاملHybrid Query Answering Over Expressive DL Ontologies
The design of tractable Description Logics, like EL [1], DL-Lite [2], and RL [5] have spurred the design and implementation of highly scalable systems such as OWLim, Oracle’s Semantic Graph, and more. The attractive properties of the these systems have in many occasions led application developers to use them even in cases where the input ontology is expressed in the far more expressive SROIQ la...
متن کاملHybrid Query Answering Over DL Ontologies
The design of tractable Description Logics, like EL [1], DL-Lite [2], and RL [5] have spurred the design and implementation of highly scalable systems such as OWLim, Oracle’s Semantic Graph, and more. The attractive properties of the these systems have in many occasions led application developers to use them even in cases where the input ontology is expressed in the far more expressive SROIQ la...
متن کاملDecidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predicate, and meta-predicate hierarchies for deriving predicate and meta-predicate assertions. Meta-level predicates (predicates of predicates) are useful for representing relationships between predicate formulas, and further, they ...
متن کاملConjunctive Query Answering in Finitely-Valued Fuzzy Description Logics
Fuzzy Description Logics (DLs) generalize crisp ones by providing membership degree semantics for concepts and roles. A popular technique for reasoning in fuzzy DL ontologies is by providing a reduction to crisp DLs and then employ reasoning in the crisp DL. In this paper we adopt this approach to solve conjunctive query (CQ) answering problems for fuzzy DLs. We give reductions for Gödel, and Ł...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016